Minimum Wiener Indices of Trees and Unicyclic Graphs of given Matching Number
نویسندگان
چکیده
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. We determine the minimum Wiener indices of trees and unicyclic graphs with given number of vertices and matching number, respectively. The extremal graphs are characterized.
منابع مشابه
The hyper-Wiener index of unicyclic graphs with given matching number
We determine the minimum hyper-Wiener index of unicyclic graphs with given number of vertices and matching number, and characterize the extremal graphs. Mathematics Subject Classification (2010): 05C12, 05C35, 05C90.
متن کاملLeap Zagreb indices of trees and unicyclic graphs
By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...
متن کاملSome Graphs with Extremal Pi Index
The Padmakar-Ivan (PI) index is a Wiener-Szeged-like topological index, which reflects certain structural features of organic molecules. In this paper, we study the maximum PI indices and the minimum PI indices for trees and unicyclic graphs respectively.
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملOn the Extremal Wiener Polarity Index of Hückel Graphs
Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. The Wiener polarity index W p (G) of a graph G is the number of unordered pairs of vertices u, v of G such that the distance between u and v is equal to 3. The trees and unicyclic graphs...
متن کامل